A lower bound on the order of the largest induced forest in planar graphs with high girth
نویسندگان
چکیده
We give here new upper bounds on the size of a smallest feedback vertex set in planar graphs with high girth. In particular, we prove that a planar graph with girth g and size m has a feedback vertex set of size at most 4m 3g , improving the trivial bound of 2m g . We also prove that every 2-connected graph with maximum degree 3 and order n has a feedback vertex set of size at most n+2 3 .
منابع مشابه
Large induced forests in planar graphs with girth 4 or 5
We give here some new lower bounds on the order of a largest induced forest in planar graphs with girth 4 and 5. In particular we prove that a triangle-free planar graph of order n admits an induced forest of order at least 6n+7 11 , improving the lower bound of Salavatipour [M. R. Salavatipour, Large induced forests in trianglefree planar graphs, Graphs and Combinatorics, 22:113–126, 2006]. We...
متن کاملA lower bound on the order of the largest induced linear forest in triangle-free planar graphs
We prove that every triangle-free planar graph of order n and size m has an induced linear forest with at least 9n−2m 11 vertices, and thus at least 5n+8 11 vertices. Furthermore, we show that there are triangle-free planar graphs on n vertices whose largest induced linear forest has order ⌈n2 ⌉+ 1.
متن کاملAn improved bound on the largest induced forests for triangle-free planar graphs
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth.
متن کاملInduced Forests in Regular Graphs with Large Girth
An induced forest of a graph G is an acyclic induced subgraph of G. The present paper is devoted to the analysis of a simple randomised algorithm that grows an induced forest in a regular graph. The expected size of the forest it outputs provides a lower bound on the maximum number of vertices in an induced forest of G. When the girth is large and the degree is at least 4, our bound coincides w...
متن کاملDecomposing a planar graph with girth 9 into a forest and a matching
W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 214 شماره
صفحات -
تاریخ انتشار 2016